A 17/12-approximation algorithm for 2-vertex-connected spanning subgraphs on graphs with minimum degree at least 3
نویسنده
چکیده
We obtain a polynomial-time 17 12 -approximation algorithm for the minimum-cost 2-vertexconnected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for finding the smallest 2-edge-connected spanning subgraph by Cheriyan, Sebo and Szigeti (SIAM J.Discrete Math. 2001) who gave a 17 12 -approximation algorithm for this problem, and by Sebo and Vygen (Combinatorica 2014), who improved the approximation ratio to 4 3 .
منابع مشابه
Approximation Algorithms for k-Connected Graph Factors
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of minimum weight with connectivity requirements. For the case of k-edge-connectedness, we present approximation algorithms that achieve constant approximation ratios for all d ≥...
متن کاملFinding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5
The problem of finding a minimum weight k-vertex connected spanning subgraph is considered. For k ≥ 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs and of k-out-connected graphs (i.e., graphs which contain a vertex from which there exist k internally vertex-disjoint paths to every other vertex), we derive polynomial time approximation ...
متن کاملLinear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs
We present the first polynomial-time approximation schemes, i.e., (1 + )-approximation algorithm for any constant > 0, for the minimum three-edge connected spanning subgraph problem and the minimum three-vertex connected spanning subgraph problem in undirected planar graphs. Both the approximation schemes run in linear time. This material is based upon work supported by the National Science Fou...
متن کاملApproximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-w...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1612.04790 شماره
صفحات -
تاریخ انتشار 2016